One-relation languages and code generators
نویسندگان
چکیده
We investigate the open problem to characterize whether infinite power of a given language is generated by an ω -code. In case code ( i.e. zero-relation language), was solved. this work, we solve for class one-relation languages.
منابع مشابه
Hierarchical Code Generators
Hierarchically organised recursive virtual machines can be used as a novel dynamic hierarchies modelling technique. Such a technique is based on the traditional notion of computing machines. The discussed technique allows a detailed analysis of different aspects of hierarchical complex system decomposition, together with the analysis of interactions between and within different hierarchical lev...
متن کاملReduced Languages as omega -Generators
We consider the following decision problem: “Is a rational ω-language generated by a code ?” Since 1994, the codes admit a characterization in terms of infinite words. We derive from this result the definition of a new class of languages, the reduced languages. A code is a reduced language but the converse does not hold. The idea is to “reduce” easy-to-obtain minimal ω-generators in order to ob...
متن کاملReduced languages as ω-generators
We consider the following decision problem: “Is a rational ω-language generated by a code ?” Since 1994, the codes admit a characterization in terms of infinite words. We derive from this result the definition of a new class of languages, the reduced languages. A code is a reduced language but the converse does not hold. The idea is to “reduce” easy-to-obtain minimal ω-generators in order to ob...
متن کاملDesign Wizards and Visual Languages for Generators
Domain-specific generators will increasingly rely on graphical specification languages — applets — for declarative specifications of target applications. Applets will provide front-ends to generators and related tools to produce customized code on demand. Critical to the success of this approach will be domain-specific design wizards, tools that guide users in their selection of components for ...
متن کاملSequence Generators, Graphs, and Formal Languages
A sequence generator is a finite graph, more general than, but akin to, the usual state diagram associated with a finite automaton. The nodes of a sequence generator represent complete states, and each node is labeled with an input and an o u t p u t state. An element of the behavior of a sequence generator is obtained by taking the input and output states along an infinite path of the graph. S...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Informatics and Applications
سال: 2021
ISSN: ['0988-3754', '1290-385X']
DOI: https://doi.org/10.1051/ita/2021002